Národní úložiště šedé literatury Nalezeno 1 záznamů.  Hledání trvalo 0.01 vteřin. 
Computing the Decomposable Entropy of Graphical Belief Function Models
Jiroušek, Radim ; Kratochvíl, Václav ; Shenoy, P. P.
In 2018, Jiroušek and Shenoy proposed a definition of entropy for Dempster-Shafer (D-S) belief functions called decomposable entropy. Here, we provide an algorithm for computing the decomposable entropy of directed graphical D-S belief function models. For undirected graphical belief function models, assuming that each belief function in the model is non-informative to the others, no algorithm is necessary. We compute the entropy of each belief function and add them together to get the decomposable entropy of the model. Finally, the decomposable entropy generalizes Shannon’s entropy not only for the probability of a single random variable but also for multinomial distributions expressed as directed acyclic graphical models called Bayesian networks.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.